Brian Alspach and his work
نویسندگان
چکیده
The conference banquet provided a rare opportunity for Brian’s colleagues, collaborators, and students, as well as friends and family members to get together, and to share stories about Brian. The guests were delightfully entertained by the “Brian Alspach Quiz” prepared for the occasion by Brooks Reid, who served as the Master of Ceremonies. Brooks has graciously allowed us to include some of his quiz questions in this paper. We are happy to share
منابع مشابه
Cycles in the block-intersection graph of pairwise balanced designs
The focws of this thesis is to investigate certain graph theoretic propertir-s of a class of graphs \shicL arise from combinatorial design theory. The Itlock-i~~tc.rscc.tion graph of a pairwise balanced design has as its vertices tlw Mocks of tllc (hasign ;irici has as its edges precisely those pairs of blocks wliicll llrtvr. nori-cm~pty ilitc~rsc~c'ticm. These graphs have a particular local st...
متن کاملOn groups of odd prime-power degree that contain a full cycle
The Graph Theory of Brian Alspach Simon Fraser University Burnaby, B.C. May 25 – 29, 2003 In multi-author talks “?” indicates the speaker.
متن کاملMatching designs
Matching Designs Brian Alspach and Katherine Heinrich Department of Mathematics and Statistics Simon Fraser University Burnaby, British Columbia V5A IS6 Canada A collection of k-matchings of K 1'1 with the property that every pair of independent edges lies in exactly A of the k-matchings is called a MATCH(n.k.'A.)-design and the analogous design for the bipartite graph Kn •n is called a BIMATCH...
متن کاملCycle covers of cubic multigraphs
Alspach, B. and C.-Q. Zhang, Cycle covers of cubic multigraphs, Discrete Mathematics 111 (1993) 11-17.
متن کاملEdge-pancyclic block-intersection graphs
Alspach, B. and D. Hare, Edge-pancyclic block-intersection graphs, Discrete Mathematics 97 (1991) 17-24. It is shown that the block-intersection graph of both a balanced incomplete block design with block size at least 3 and A = 1, and a transversal design is edge-pancyclic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 299 شماره
صفحات -
تاریخ انتشار 2005